Scheduling with incompatible jobs
Identifieur interne : 000299 ( LNCS/Analysis ); précédent : 000298; suivant : 000300Scheduling with incompatible jobs
Auteurs : Hans L. Bodlaender [Pays-Bas] ; Klaus Jansen [Allemagne] ; Gerhard J. Woeginger [Autriche]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1993.
Abstract
Abstract: We consider scheduling problems in a multiprocessor system with incompatible jobs (two incompatible jobs cannot be processed by the same machine). We consider the problem to minimize the maximum job completion time, the makespan. This problem is NP-complete. We present a number of polynomial time approximation algorithms for this problem where the job incompatibilities possess a special structure. As the incompatibilities form a graph on the set of jobs, our algorithms strongly rely on graph theoretic methods. We also solve an open problem by Biró, Hujter and Tuza on coloring precolored bipartite graphs.
Url:
DOI: 10.1007/3-540-56402-0_34
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001172
- to stream Istex, to step Curation: 001060
- to stream Istex, to step Checkpoint: 001315
- to stream Main, to step Merge: 003162
- to stream Main, to step Curation: 002C11
- to stream Main, to step Exploration: 002C11
- to stream LNCS, to step Extraction: 000299
Links to Exploration step
ISTEX:C410D5A7140005B4944F0E030954FA71E173F1ABLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Scheduling with incompatible jobs</title><author><name sortKey="Bodlaender, Hans L" sort="Bodlaender, Hans L" uniqKey="Bodlaender H" first="Hans L." last="Bodlaender">Hans L. Bodlaender</name></author><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name></author><author><name sortKey="Woeginger, Gerhard J" sort="Woeginger, Gerhard J" uniqKey="Woeginger G" first="Gerhard J." last="Woeginger">Gerhard J. Woeginger</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:C410D5A7140005B4944F0E030954FA71E173F1AB</idno><date when="1993" year="1993">1993</date><idno type="doi">10.1007/3-540-56402-0_34</idno><idno type="url">https://api.istex.fr/document/C410D5A7140005B4944F0E030954FA71E173F1AB/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001172</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001172</idno><idno type="wicri:Area/Istex/Curation">001060</idno><idno type="wicri:Area/Istex/Checkpoint">001315</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001315</idno><idno type="wicri:doubleKey">0302-9743:1993:Bodlaender H:scheduling:with:incompatible</idno><idno type="wicri:Area/Main/Merge">003162</idno><idno type="wicri:Area/Main/Curation">002C11</idno><idno type="wicri:Area/Main/Exploration">002C11</idno><idno type="wicri:Area/LNCS/Extraction">000299</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Scheduling with incompatible jobs</title><author><name sortKey="Bodlaender, Hans L" sort="Bodlaender, Hans L" uniqKey="Bodlaender H" first="Hans L." last="Bodlaender">Hans L. Bodlaender</name><affiliation wicri:level="4"><country xml:lang="fr">Pays-Bas</country><wicri:regionArea>Department of Computer Science, Utrecht University, P.O.Box 80.089, 3508, TB Utrecht</wicri:regionArea><orgName type="university">Université d'Utrecht</orgName><placeName><settlement type="city">Utrecht</settlement><region nuts="2">Utrecht (province)</region></placeName></affiliation></author><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, W-5500, Trier</wicri:regionArea><wicri:noRegion>Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation></author><author><name sortKey="Woeginger, Gerhard J" sort="Woeginger, Gerhard J" uniqKey="Woeginger G" first="Gerhard J." last="Woeginger">Gerhard J. Woeginger</name><affiliation wicri:level="1"><country xml:lang="fr">Autriche</country><wicri:regionArea>Institut für Informationsverarbeitung, TU Graz, Klosterwiesgasse 32, A-8010, Graz</wicri:regionArea><wicri:noRegion>Graz</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1993</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">C410D5A7140005B4944F0E030954FA71E173F1AB</idno><idno type="DOI">10.1007/3-540-56402-0_34</idno><idno type="ChapterID">5</idno><idno type="ChapterID">Chap5</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We consider scheduling problems in a multiprocessor system with incompatible jobs (two incompatible jobs cannot be processed by the same machine). We consider the problem to minimize the maximum job completion time, the makespan. This problem is NP-complete. We present a number of polynomial time approximation algorithms for this problem where the job incompatibilities possess a special structure. As the incompatibilities form a graph on the set of jobs, our algorithms strongly rely on graph theoretic methods. We also solve an open problem by Biró, Hujter and Tuza on coloring precolored bipartite graphs.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Autriche</li><li>Pays-Bas</li></country><region><li>Utrecht (province)</li></region><settlement><li>Utrecht</li></settlement><orgName><li>Université d'Utrecht</li></orgName></list><tree><country name="Pays-Bas"><region name="Utrecht (province)"><name sortKey="Bodlaender, Hans L" sort="Bodlaender, Hans L" uniqKey="Bodlaender H" first="Hans L." last="Bodlaender">Hans L. Bodlaender</name></region></country><country name="Allemagne"><noRegion><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name></noRegion></country><country name="Autriche"><noRegion><name sortKey="Woeginger, Gerhard J" sort="Woeginger, Gerhard J" uniqKey="Woeginger G" first="Gerhard J." last="Woeginger">Gerhard J. Woeginger</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/LNCS/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000299 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/LNCS/Analysis/biblio.hfd -nk 000299 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= LNCS
|étape= Analysis
|type= RBID
|clé= ISTEX:C410D5A7140005B4944F0E030954FA71E173F1AB
|texte= Scheduling with incompatible jobs
}}
| This area was generated with Dilib version V0.6.31. |  |